翻訳と辞書
Words near each other
・ Self-stabilization
・ Self-steering gear
・ Self-stereotyping
・ Self-storage box
・ Self-Strengthening Movement
・ Self-styled orders
・ Self-sufficiency
・ Self-Sufficiency Project
・ Self-surgery
・ Self-sustainability
・ Self-synchronizing code
・ Self-tapping screw
・ Self-Taught Learner
・ Self-taxation
・ Self-testing code
Self-tiling tile set
・ Self-titled (disambiguation)
・ Self-Titled (Zao album)
・ Self-titled Album (The Audition album)
・ Self-titled Album (The Huntingtons album)
・ Self-Titled Long-Playing Debut Album
・ Self-titled/Homebrew
・ Self-transcendence
・ Self-Transcendence 12+24 Hour Race Basel
・ Self-Transcendence 24 Hour Race Ottawa
・ Self-Transcendence 3100 Mile Race
・ Self-Transcendence 6- & 10-day Race
・ Self-Transcendence Marathon
・ Self-transforming brain
・ Self-translation


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Self-tiling tile set : ウィキペディア英語版
Self-tiling tile set

A self-tiling tile set, or ''setiset'', of order ''n'' is a set of ''n'' shapes or pieces, usually planar, each of which can be tiled with smaller replicas of the complete set of ''n'' shapes. That is, the ''n'' shapes can be assembled in ''n'' different ways so as to create larger copies of themselves, where the increase in scale is the same in each case. Figure 1 shows an example for ''n'' = 4 using distinctly shaped decominoes. The concept can be extended to include pieces of higher dimension. The name setisets was coined by Lee Sallows in 2012,〔(''On Self-Tiling Tile Sets'' ), by Lee Sallows, Mathematics Magazine, Vol. 85, No. 5, December 2012〕〔(Alejandro Erickson on Self-tiling tile sets )〕 but the problem of finding such sets for ''n'' = 4 was asked decades previously by C. Dudley Langford, and examples for polyaboloes (discovered by Martin Gardner, Wade E. Philpott and others) and polyominoes (discovered by Maurice J. Povah) were previously published by Gardner.〔''Polyhexes and Polyaboloes'' in ''Mathematical Magic Show'', by Martin Gardner, Knopf, 1977, pp 146-159〕
==Examples and definitions==

From the above definition it follows that a setiset composed of ''n'' identical pieces is the same thing as a 'self-replicating tile' or rep-tile, of which setisets are therefore a generalization.〔More On Self-Tiling Tile Sets, Mathematics Magazine Vol 87, No 2, April 2014, pp 100-112〕 Setisets using ''n'' distinct shapes, such as Figure 1, are called ''perfect''. Figure 2 shows an example for ''n'' = 4 which is ''imperfect'' because two of the component shapes are the same.
The shapes employed in a setiset need not be ''connected'' regions. Disjoint pieces composed of two or more separated islands are also permitted. Such pieces are described as ''disconnected'', or ''weakly-connected'' (when islands join only at a point), as seen in the setiset shown in Figure 3.
The fewest number of pieces in a setiset is two. Figure 4 encapsulates an infinite family of order 2 setisets each composed of two triangles, ''P'' and ''Q''. As shown, the latter can be hinged together to produce a compound triangle that has the same shape as ''P'' or ''Q'', depending upon whether the hinge is fully open or fully closed. This unusual specimen thus provides an example of a hinged dissection.


抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Self-tiling tile set」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.